Computing Twin Primes and Brun's Constant: A Distributed Approach
نویسندگان
چکیده
This paper describes an implementation of a large heterogeneous distributed parallel computation that counts the distribution of twin primes and calculates Brun’s constant and maximal distances between pairs of twin primes. Two primes are twins if they differ by two. It is not known if there are infinitely many twin primes but it was proven that the sum of their inverses converges to the value defined as Brun’s constant [2]. Prior to this work, the number of twins and their contribution to Brun’s constant was known for all twins up to . We have advanced this calculation to and are planning to continue to . The computation is distributed using the farmer-workers paradigm. The farmer divides the numerical range into intervals of 10 billion. Workers are assigned intervals to analyze and return results. If a worker fails, e.g., it does not return results within a given time period, the farmer reassigns its intervals to other workers. The farmer also frequently saves its state. If the farmer dies, a new one can be started up with minimal loss of work. This paper describes the algorithm for locating twin primes, a modified Sieve of Eratosthenes. It also discusses the method for distributing the work to clients, time and space saving optimizations, and multi-platform support. We conclude by presenting some preliminary results up to future directions for the system.
منابع مشابه
Irregularities in the Distribution of Primes and Twin Primes
The maxima and minima of sL(x)) — n(x), iR(x)) — n(x), and sL2(x)) — n2(x) in various intervals up to x = 8 x 10 are tabulated. Here n(x) and n2(x) are respectively the number of primes and twin primes not exceeding x, L(x) is the logarithmic integral, R(x) is Riemann's approximation to ir(x), and L2(x) is the Hardy-Littlewood approximation to ti"2(;c). The computation of the sum of inverses of...
متن کاملOn the Twin and Cousin Primes
The computer results of the investigation of the number of pairs of primes separated by gap d = 2 (\twins") and gap d = 4 (\cousins") are reported. The number of twins and cousins turn out to be is almost the same. The plot of the function W (x) giving the diierence of the number of twins and cousins for x 2 (1; 10 12) is presented. This function has fractal properties and the fractal dimension...
متن کاملResearch Statement Dominic Klyve
My research concerns explicit inequalities in elementary number theory. Specifically, I am interested in the distribution of twin primes, along with theoretical and computational techniques for putting explicit bounds on classes numbers such as twin primes. One important method I use to examine the density of twins is to look for bounds on Brun’s Constant. 1. Motivation and Background Twin prim...
متن کاملPrimeGrid: a Volunteer Computing Platform for Number Theory
Since 2005, PrimeGrid has grown from a small project factorising RSA numbers by brute force to one of the largest volunteer computing projects in the world. The project has discovered over 60 new million-digit primes, as well as record sized twin and Sophie Germain primes. This paper will present a history of the project, the algorithms and software used by PrimeGrid and how the BOINC distribut...
متن کامل